A-star Optimization with Heap-sort Algorithm on NPC Character

Objectives: To find out whether the A-star algorithm that is optimized with heap-sort can reach target destination faster than native Astar when applied on NPC to path. Methods: Comparisons are made by implementing an and in a dungeon-crawling game genre applying five different scenarios, where each scenario has start position of NPC, goal set. The comparison measuring time required both algorithms milliseconds Unity engine software C# language. Findings: From results experiments calculation, it was found 50%-80% using only cases alone game. Novelty: novelty this research optimization heap-sort, then compared NPCs genre. Keywords: AStar; Heap Sort; NonPlayable Character; Optimization Algorithm; Pathfinding